Redundancies and Don't Cares in Sequential Logic Synthesis
نویسندگان
چکیده
منابع مشابه
Don't cares in synthesis: theoretical pitfalls and practical solutions
E ective use of don't cares requires solving several theoretical and practical problems. The theoretical problems are caused by a need to have all tools in a methodology use a consistent semantics of don't cares, so as to guarantee correctness of the nal implementation. Several common meanings of \don't care" will be considered and their respective conditions for design correctness will be deri...
متن کاملJerome Fron
There has been intense research in using degrees of freedom (or don't care conditions) to optimize sequential and combinational circuits. The scope of logic synthesis. however. is limited by the lack of information being passed from high-level synthesis tools. In this paper. we present a general framework to model the degrees of frea1om at the behavioral level. in a fonn that can be used by seq...
متن کاملA unified approach to the synthesis of fully testable sequential machines
• In this paper we attempt to unify and extend the various approaches to synthesizing fully S testable sequential circuits that can be modeled as finite state machines (FSMs). We first identify classes of redundancies and isolate equivalent-state redundancies as those most difficult to eliminate. We then show that the essential problem behind equivalent-state redundancies is the creation of val...
متن کاملE cient Use of Large Don't Cares in High-Level and Logic Synthesis
This paper describes optimization techniques using don't-care conditions that span the domain of highlevel and logic synthesis. The following three issues are discussed: 1) how to describe and extract don't-care conditions from high-level descriptions; 2) how to pass don't-care conditions from high-level to logic synthesis; and 3) how to optimize the logic using don't-care conditions. E cient t...
متن کاملRapid Gate Matching with Don't Cares
Ending the logic synthesis, the technology mapping step maps the Boolean function on physical cells. This itep is based on a matching check, which complexity depends on the number of library cell inputs, and increases if don't cares are considered. The method presented here is based on fault analysis. Using a structural equivalent of the cell, it allows to prune dramatically the design space, a...
متن کامل